Approximation by Conic Splines
نویسندگان
چکیده
We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε +O(1), if the spline consists of parabolic arcs, and c2ε + O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 are expressed in the Euclidean and affine curvature of the curve. We also show that the Hausdorff distance between a curve and an optimal conic arc tangent at its endpoints is increasing with its arc length, provided the affine curvature along the arc is monotone. This property yields a simple bisection algorithm for the computation of an optimal parabolic or conic spline.
منابع مشابه
Cone spline approximation via fat conic spline fitting
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone spline can then be changed as the problem of fitting a plane fat curve by a fat conic spline. Moreover, the fitting error between the ruled surface and the cone spline can be estimated explicitly via fat conic spline fit...
متن کاملApproximation by C Splines on Piecewise Conic Domains
We develop a Hermite interpolation scheme and prove error bounds forC bivariate piecewise polynomial spaces of Argyris type vanishing on the boundary of curved domains enclosed by piecewise conics.
متن کاملIntelligent Approaches for Vectorizing Image Outlines
Two computing approaches, based on linear and conic splines, are proposed here in reviewed and extended for vectorizing image outlines. Both of the approaches have various phases including extracting outlines of images, detecting corner points from the detected outlines, and curve fitting. Interpolation splines are the bases of the two approached. Linear spline approach is straight forward as i...
متن کاملHigh-order approximation of conic sections by quadratic splines
Given a segment of a conic section in the form of a rational Bézier curve, a quadratic spline approximation is constructed and an explicit error bound is derived. The convergence order of the error bound is shown to be O(h) which is optimal, and the spline curve is both C and G. The approximation method is very efficient as it is based on local Hermite interpolation and subdivision. The approxi...
متن کاملVectorizing Image Outlines using Spline Computing Approaches with Simulated Annealing
This paper is an overview of three spline approaches of degree one, two and three. It represents the review and comparative study of Linear, conic and cubic splines for the vectorization of outlines of the planar images. It has various phases including extracting outlines of images, detecting corner points from the detected outlines, and curve fitting. The idea of simulated annealing has been i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematics in Computer Science
دوره 1 شماره
صفحات -
تاریخ انتشار 2007